Constructing Irreducible Polynomials with Prescribed Level Curves over Finite Fields
نویسنده
چکیده
We use Eisenstein’s irreducibility criterion to prove that there exists an absolutely irreducible polynomial P(X,Y) ∈ GF(q)[X,Y] with coefficients in the finite field GF(q) with q elements, with prescribed level curves Xc := {(x,y)∈GF(q)2 | P(x,y)= c}. 2000 Mathematics Subject Classification. 11T06.
منابع مشابه
Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients
For any positive integers n ≥ 3, r ≥ 1 we present formulae for the number of irreducible polynomials of degree n over the finite field F2r where the coefficients of xn−1, xn−2 and xn−3 are zero. Our proofs involve counting the number of points on certain algebraic curves over finite fields, a technique which arose from Fourier-analysing the known formulae for the F2 base field cases, reverse-en...
متن کاملElliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed
Let Fq be a finite field of characteristic p = 2, 3. We give the number of irreducible polynomials x + am−1x m−1 + · · · + a0 ∈ Fq[x] with am−1 and am−3 prescribed for any given m if p = 2, and with am−1 and a1 prescribed for m = 1, . . . , 10 if p = 2, 3.
متن کاملGenerators of Finite Fields with Powers of Trace Zero and Cyclotomic Function Fields
Using the relation between the problem of counting irreducible polynomials over finite fields with some prescribed coefficients to the problem of counting rational points on curves over finite fields whose function fields are subfields of cyclotomic function fields, we count the number of generators of finite fields with powers of trace zero up to some point, answering a question of Z. Reichste...
متن کاملRecurrent methods for constructing irreducible polynomials over Fq of odd characteristics, II
In this note by using Dickson’s theorem we construct families of irreducible polynomials of degree 4nk (k = 1, 2, ...) over a finite field of odd characteristics. Also we apply Q-Transformation and present a new recurrent method for constructing a families of irreducible polynomials of degree 2nk (k = 1, 2, ...) over the finite field of F3s . Mathematics Subject Classification: 12A20
متن کاملThe Number of Irreducible Polynomials with First Two Prescribed Coefficients over a Finite Field
We use elementary combinatorial methods together with the theory of quadratic forms over finite fields to obtain the formula, originally due to Kuz’min, for the number of monic irreducible polynomials of degree n over a finite field Fq with first two prescribed coefficients. The formula relates the number of such irreducible polynomials to the number of polynomials that split over the base field.
متن کامل